FCGlight: Making the bridge between Fluid Construction Grammars and main-stream unification grammars by using feature constraint logics

نویسنده

  • Liviu Ciortuz
چکیده

Fluid Construction Grammars (FCGs) are a flavour of Construction Grammars, which themselves are unification-based grammars. Its syntax is (only) up to certain extent similar to other unification-based grammars. However, it lacks a declarative semantics, while its procedural semantics is truly particular, compared to other unification-based grammar formalisms. Here we propose the re-definition of a subset of the FCG formalism (henceforth called FCGlight) within the framework of (order-sorted) feature constraint logics (OSF-logic) that would assign FCG a rigorous (both declarative a and procedural) semantics, which is suitable for both parsing, generation and grammar learning. In this way we will be able to compare FCG to other unification-based grammars. We will also get the advantage of associating it another classical paradigm for learning (“evolving”) new grammars. This is learning in hierarchies (lattices) of concepts which exploits a partial order relation (generalisation / specialisation) between grammars, instead of the method currently used by FCG, which is (inspired by) reinforcement learning. This will enable a rather natural link with the linguistic background knowledge when devising the grammar repair strategies and a clear way to compare different grammars that could be learned by an agent at each step during the grammar evolution process. In return, inspired by the FCG approach to grammar learning, we are able to define new ways for learning grammars in other unification-based formalisms. In particular, ILP-like learning of HPSGs can be substantially improved by using ideas borrowed from FCG: − instead of using a given “golden” test suite (against which the learning is performed), this test suite is dynamically produced during the language game (played by two agents); − the grammar learning process will be “grounded”, something which was not considered before; − we will learn also new rules (instead of modifying the given ones, as currently done in ilpLIGHT) − learning new rules by generalising upon already learned rules, will also be a significant step forward.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Constraint Logics for Unification Grammars

This paper studies feature description languages that have been developed for use in uniication grammars, logic programming and knowledge representation. The distinctive notational primitive of these languages are features that can be understood as unary partial functions on a domain of abstract objects. We show that feature description languages can be captured naturally as sublanguages of rst...

متن کامل

Feature Matrices and Agreement: A Case Study for German Case

This paper illustrates the use of ‘feature matrices’, a technique for handling ambiguity and feature indeterminacy in feature structure grammars using unification as the single mechanism for processing. Both phenomena involve forms that can be mapped onto multiple, often conflicting values. This paper illustrates their respective challenges through German case agreement, which has become the li...

متن کامل

An Informal Sketch of a Formal Architecture for Construction Grammar

A formal architecture for Construction Grammar (CG) is sketched. Modeling domain objects (constructs) are constituent structures with feature structures at the nodes, aka Feature Structure Trees (FTs). Constructions are partial descriptions of FTs, expressed as sets of constituent structure equations and path equations. Unification of constructions is defined. A construct c is licensed by a gra...

متن کامل

An Algebra for Semantic Construction in Constraint-based Grammars

We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to the lambda calculus; it maintains much of the desirable flexibility of unificationbased approaches to composition, while constraining the allowable operations in order to capture basic generalizations and improve mainta...

متن کامل

Constraint-based RMRS Construction from Shallow Grammars

We present a constraint-based syntax-semantics interface for the construction of RMRS (Robust Minimal Recursion Semantics) representations from shallow grammars. The architecture is designed to allow modular interfaces to existing shallow grammars of various depth – ranging from chunk grammars to context-free stochastic grammars. We define modular semantics construction principles in a typed fe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010